Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Authors
Abstract:
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for modelling the problem at hand and, because it is classified in large scale problems, the column generation approach has been used to solve LP relaxation of the set partitioning model. Our focus will be on solving the column generation sub-problem. For this purpose, two algorithms, named SPRCF and SPRCD, have been developed based on the shortest path with resource constraint algorithms. Their efficiency in solving some problem instances has been tested and the results have been compared with those of an algorithm for crew pairing problem reported in the literature. Results indicate the high efficiency of the proposed algorithms in solving problem instances with up to 632 flight legs in a reasonable time.
similar resources
cockpit crew pairing problem in airline scheduling: shortest path with resources constraints approach
increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. crew costs are second only to fuel costs on the cost list of airline companies. so, this paper attempts to investigate the cockpit crew pairing problem. the set partitioning problem has been used for ...
full textA Subsequence Generation Approach for the Airline Crew Pairing Problem
In this paper we consider an important problem for the airline industry. The widely studied crew pairing problem is typically formulated as a set partitioning problem and solved using the branchand-price methodology. Here we develop a new integer programming framework, based on the concept of subsequence generation, for solving the set partitioning formulation. In subsequence generation one res...
full textSolving a robust airline crew pairing problem with column generation
In this study, we solve a robust version of the airline crew pairing problem. Our concept of robustness was partially shaped during our discussions with small local airlines in Turkey which may have to add a set of extra flights into their schedule at short notice during operation. Thus, robustness in this case is related to the ability of accommodating these extra flights at the time of operat...
full textA Stochastic Programming Approach to the Airline Crew Scheduling Problem
Traditional methods model the billion-dollar airline crew scheduling problem as deterministic and do not explicitly include information on potential disruptions. Unfortunately, the effort used to optimize crew schedules and reduce crew costs is often wasted as flight schedules are often disrupted. Consequently, airlines spend a great deal of time and money optimizing crew schedules in the plann...
full textGeneration Approach to Airline Crew Scheduling
The airline crew scheduling problem deals with the construction of crew rotations in order to cover the flights of a given schedule at minimum cost. The problem involves complex rules for the legality and costs of individual pairings and base constraints for the availability of crews at home bases. A typical instance considers a planning horizon of one month and several thousand flights. We pro...
full textMy Resources
Journal title
volume 24 issue 4
pages 259- 268
publication date 2013-12
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023